翻訳と辞書 Words near each other ・ Unfinished Symphony (film) ・ Unfinished Tales ・ Unfit for Command ・ Unfit for Swine ・ Unfit to Practise ・ Unflappable ・ Unflesh ・ Unfold ・ Unfold (John O'Callaghan album) ・ Unfold (Marié Digby album) ・ Unfold the Future ・ Unfold Yourself (album) ・ Unfoldable cardinal ・ Unfolded protein response ・ Unfolding ・ Unfolding (DSP implementation) ・ Unfolding (functions) ・ Unfolding (music) ・ Unfolding (sculpture) ・ Unfolding Object ・ Unfolding Rhythms ・ Unfoldment ・ Unforeseen Blessings ・ Unforeseen Shadows ・ Unforgetful You ・ Unforgettable ・ Unforgettable (1996 film) ・ Unforgettable (2011 TV series) ・ Unforgettable (2013 TV series) ・ Unforgettable (2014 film) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Unfolding (DSP implementation) ： ウィキペディア英語版 Unfolding (DSP implementation) Unfolding is a transformation technique of duplicating the functional blocks to increase the throughput of the DSP program in such a way that preserves its functional behavior at its outputs. Unfolding was first proposed by Keshab K. Parhi and David G. Messerschmitt in 1989. .〔K. K. Parhi and D. G. Messerschmitt,"Fully-static rate-optimal scheduling of iterative data-flow program via optimum unfolding," Proc. of Int'l Conf. on Parallel Processing, 1989, pp. 1-209 – 1-216〕 Unfolding in general program is as known as Loop unrolling Unfolding has applications in designing high-speed and low-power ASIC architectures. One application is to unfold the program to reveal hidden concurrency so that the program can be scheduled to a smaller iteration period, thus increasing the throughput of the implementation. Another application is parallel processing in word level or bit level. Therefore these transformed circuit could increase the throughput and decrease the power consumption. ==Example== For a DSP program $\backslash scriptstyle\; y(n)=ay(n-9)+x(n)$, replacing the index $\backslash scriptstyle\; n$ by $\backslash scriptstyle\; 2k$ could result $\backslash scriptstyle\; y(2k)=ay(2k-9)+x(2k)$. Similarly, replacing the index $\backslash scriptstyle\; n$ by $\backslash scriptstyle\; 2k+1$ could also result as $\backslash scriptstyle\; y(2k+1)=ay(2k-8)+x(2k+1)$. Hence, we transform the program into following program that receives 2 inputs $\backslash scriptstyle\; x$ and produce 2 outputs $\backslash scriptstyle\; y$ at each time. :$y(2k)=ay(2k-9)+x(2k)$ :$y(2k+1)=ay(2k-8)+x(2k+1)$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Unfolding (DSP implementation)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.